\documentclass[b5paper,twoside]{book}
\usepackage[nomarginpar
  %, margin=.5in
  , top=1.5cm, bottom=1.5cm, left=2cm, right=2cm
]{geometry}

% ==================== Book flag==========================

\global\let\wholebook=\relax %without relax, we build article, else book

\usepackage[en]{prelude}

\setcounter{page}{1}

\graphicspath{
	{img/}
    {others/preface/}
	{datastruct/tree/binary-search-tree/}
    {sorting/insertion-sort/}
	{datastruct/tree/red-black-tree/}
    {datastruct/tree/AVL-tree/}
	{datastruct/tree/trie/}
    {datastruct/tree/suffix-tree/}
    {datastruct/tree/B-tree/}
    {datastruct/heap/binary-heap/}
    {sorting/select-sort/}
    {sorting/dc-sort/}
    {datastruct/heap/other-heaps/}
    {datastruct/elementary/queue/}
    {datastruct/elementary/sequence/}
    {search/}
    {others/appendix/list/}
}

\makeindex

\begin{document}

% set PDF properties
\hypersetup{pdftitle={algoxy},%
            pdfauthor={liuxinyu95@gmail.com},%
            pdfsubject={Computer Science},%
            pdfkeywords={Algorithm, Programming}}

% ================================================================
%                 COVER PAGE
% ================================================================

\title{
  {\bf \Huge Elementary Algorithms}
  \centering
  \scalebox{0.4}{\includegraphics{img/fibonacci-spiral.png}}
}

\author{LIU Xinyu
  \thanks{{\bfseries LIU Xinyu } \newline
    Version: 0.6180339887498949 \newline
    Email: liuxinyu95@gmail.com \newline
}}

\maketitle

% ================================================================
%                 Content
% ================================================================

\tableofcontents
\newpage

\subimport{others/preface/}{preface-en.tex}

\subimport{others/appendix/list/}{list-en.tex}

\part{Trees}
\subimport{datastruct/tree/binary-search-tree/}{bstree-en.tex}

\subimport{sorting/insertion-sort/}{isort-en.tex}

\subimport{datastruct/tree/red-black-tree/}{rbtree-en.tex}

\subimport{datastruct/tree/AVL-tree/}{avltree-en.tex}

\subimport{datastruct/tree/trie/}{trie-en.tex}

\subimport{datastruct/tree/B-tree/}{btree-en.tex}


\part{Heaps}
\subimport{datastruct/heap/binary-heap/}{bheap-en.tex}

\subimport{sorting/select-sort/}{ssort-en.tex}

\subimport{datastruct/heap/other-heaps/}{kheap-en.tex}


\part{Queues and Sequences}
\subimport{datastruct/elementary/queue/}{queue-en.tex}

\subimport{datastruct/elementary/sequence/}{sequence-en.tex}

\part{Sorting and Searching}
\subimport{sorting/dc-sort/}{dcsort-en.tex}

\subimport{search/}{search-en.tex}

\part{Appendix}
\appendix
%\appendixpage
\noappendicestocpagenum
\addappheadtotoc

\subimport{others/appendix/rbt-del/}{rbt-del-en.tex}

\subimport{others/appendix/avltree/}{avl-proof-en.tex}

\subimport{datastruct/tree/suffix-tree/}{stree-en.tex}

\subimport{others/appendix/}{bib-en.tex}

\input{fdl-1.3.tex}

\printindex

\end{document}
